Grouping Building Material Sales for Management Optimization with the K-Means Algorithm
نویسندگان
چکیده
Sales transactions at the Pedi Building Store are recorded in daily logbook provided by store, so that it cannot be immediately known which types of products selling well or not well. To overcome this problem, an analysis sales data is carried out using K-Means Algorithm. The algorithm requires as many input parameters and divides a set objects into clusters level similarity between members one cluster high, while with other very low. This study aims to determine sell don't used 100 samples 2 formed, namely unsold goods (Cluster 1) salable 2). With Algorithm, produces 4 items 1), 96 results application was developed for managed makes easy sellers manage form processes less
منابع مشابه
An Optimization K-Modes Clustering Algorithm with Elephant Herding Optimization Algorithm for Crime Clustering
The detection and prevention of crime, in the past few decades, required several years of research and analysis. However, today, thanks to smart systems based on data mining techniques, it is possible to detect and prevent crime in a considerably less time. Classification and clustering-based smart techniques can classify and cluster the crime-related samples. The most important factor in the c...
متن کاملPersistent K-Means: Stable Data Clustering Algorithm Based on K-Means Algorithm
Identifying clusters or clustering is an important aspect of data analysis. It is the task of grouping a set of objects in such a way those objects in the same group/cluster are more similar in some sense or another. It is a main task of exploratory data mining, and a common technique for statistical data analysis This paper proposed an improved version of K-Means algorithm, namely Persistent K...
متن کاملOptimization Fusion Approach For Image Segmentation Using K-Means Algorithm
This paper presents a new ,simple and Efficient segmentation approach,based on a fusion procedure which aims at combining several segmentation maps associated to simpler partition models in order to finally get a more reliable, accurate and a non-overlapped image result. The main objective of the paper is to get a non-overlapping and a reliable output by using k-means and genetic algorithm. The...
متن کاملOptimization Fusion Approach for Image Segmentation Using K-Means Algorithm
This paper presents a new, simple and efficient segmentation approach, based on a fusion procedure which aims at combining several segmentation maps associated to simpler partition models in order to finally get a more reliable, accurate and a non-overlapped image result. The main objective of the paper is to get a non-overlapping and a reliable output by using k-means and genetic algorithm. Th...
متن کاملAn Improved K-Means with Artificial Bee Colony Algorithm for Clustering Crimes
Crime detection is one of the major issues in the field of criminology. In fact, criminology includes knowing the details of a crime and its intangible relations with the offender. In spite of the enormous amount of data on offenses and offenders, and the complex and intangible semantic relationships between this information, criminology has become one of the most important areas in the field o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: UPI YPTK Journal of Computer Scine and Information Technology
سال: 2023
ISSN: ['2502-1486']
DOI: https://doi.org/10.35134/jcsitech.v9i3.74